Algorithms for Materialized View Design in Data
نویسندگان
چکیده
Data warehouses may contain multiple views accessed by queries. When these views are related to each other and deened over overlapping portions of the base data, it may be more eecient not to materialize all the views, but rather to materialize certain \shared" portions of the base data, from which the warehouse views can be derived. Selecting views to materialize is one of the most important decisions in designing a data warehouse. In this paper, we present a framework for analyzing the issues in selecting views to materialize so as to achieve the best combination of good query performance and low view maintenance. We rst develop a heuristic algorithm which can provide a feasible solution based on individual optimal query plans. We also map the materialized view design problem as 0-1 integer programming problem, whose solution can guarantee an optimal solution.
منابع مشابه
A Solution to View Management to Build a Data Warehouse
Several techniques exist to select and materialize a proper set of data in a suitable structure that manage the queries submitted to the online analytical processing systems. These techniques are called view management techniques, which consist of three research areas: 1) view selection to materialize, 2) query processing and rewriting using the materialized views, and 3) maintaining materializ...
متن کاملبهبود الگوریتم انتخاب دید در پایگاه داده تحلیلی با استفاده از یافتن پرس وجوهای پرتکرار
A data warehouse is a source for storing historical data to support decision making. Usually analytic queries take much time. To solve response time problem it should be materialized some views to answer all queries in minimum response time. There are many solutions for view selection problems. The most appropriate solution for view selection is materializing frequent queries. Previously posed ...
متن کاملDynamic Data Warehouse Design
A data warehouse (DW) can be seen as a set of materialized views de ned over remote base relations. When a query is posed, it is evaluated locally, using the materialized views, without accessing the original information sources. The DWs are dynamic entities that evolve continuously over time. As time passes, new queries need to be answered by them. Some of these queries can be answered using e...
متن کاملUsing Relational Database Constraints to Design Materialized Views in Data Warehouses
Queries to data warehouses often involve hundreds of complex aggregations over large volumes of data, and so it is infeasible to compute these queries by scanning the data sources each time. Data warehouses therefore build a large number of materialized views to increase system performance. However, materialized views need to be immediately updated when its sources are changed, leading to a pos...
متن کاملAlgorithms for Materialized View Design in Data Warehousing Environment
Selecting views to materialize is one of the most important decisions in designing a data warehouse. In this paper, we present a framework for analyzing the issues in selecting views to materialize so as to achieve the best combination of good query performance and low view maintenance. We first develop a heuristic algorithm which can provide a feasible solution based on individual optimal quer...
متن کاملSelection of Views to Materialize Under aMaintenance Cost
A data warehouse stores materialized views derived from one or more sources for the purpose of eeciently implementing decision-support or OLAP queries. One of the most important decisions in designing a data warehouse is the selection of materialized views to be maintained at the warehouse. The goal is to select an appropriate set of views that minimizes total query response time and/or the cos...
متن کامل